On Properties and the Application of Levin-type Sequence Transformations for the Convergence Acceleration of Fourier Series∗

نویسنده

  • Herbert H. H. Homeier
چکیده

We discuss Levin-type sequence transformations {sn} → {sn} that depend linearly on the sequence elements sn, and nonlinearly on an auxiliary sequence of remainder estimates {ωn}. If the remainder estimates also depend on the sequence elements, non-linear transformations are obtained. The application of such transformations very often yields new sequences that are more rapidly convergent in the case of linearly and logarithmically convergent sequences. Also, divergent power series can often be summed, i.e., transformed to convergent sequences, by such transformations. The case of slowly convergent Fourier series is more difficult and many known sequence transformations are not able to accelerate the convergence of Fourier series due to the more complicated sign pattern of the terms of the series in comparison to power series. In the present work, the Levin-type H transformation [H.H.H. Homeier, A Levin–type algorithm for accelerating the convergence of Fourier series, Numer. Algo. 3 (1992) 245–254] is studied that involves a frequency parameter α. In particular, properties of the H transformation are derived, and its implementation is discussed. We also present some generalization of it to the case of several frequency parameters. Finally, it is shown how to use the H transformation properly in the vicinity of singularities of the Fourier series. 1991 Mathematics Subject Classification: Primary 65B05, 65B10; Secondary 40A05 40A25 42C15.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalar Levin-type Sequence Transformations

Sequence transformations are important tools for the convergence acceleration of slowly convergent scalar sequences or series and for the summation of divergent series. The basic idea is to construct from a given sequence { sn} a new sequence { s ′ n} = T ({ sn} ) where each s ′ n depends on a finite number of elements sn1 , . . . , snm . Often, the sn are the partial sums of an infinite series...

متن کامل

A Class of Convergent Series with Golden Ratio Based on Fibonacci Sequence

In this article, a class of convergent series based on Fibonacci sequence is introduced for which there is a golden ratio (i.e. $frac{1+sqrt 5}{2}),$ with respect to convergence analysis. A class of sequences are at first built using two consecutive numbers of Fibonacci sequence and, therefore,  new sequences have been used in order  to introduce a  new class of series. All properties of the se...

متن کامل

Nonlinear Sequence Transformations for the Acceleration of Convergence and the Summation of Divergent Series

Slowly convergent series and sequences as well as divergent series occur quite frequently in the mathematical treatment of scientific problems. In this report, a large number of mainly nonlinear sequence transformations for the acceleration of convergence and the summation of divergent series are discussed. Some of the sequence transformations of this report as for instance Wynn’s ǫ algorithm o...

متن کامل

0 ( 1998 ) ? { ? 1 An Asymptotically Hierarchy - consistent , Iterative Sequence Transformation for ConvergenceAcceleration of Fourier Series

We derive the I transformation, an iterative sequence transformation that is useful for the convergence acceleration of certain Fourier series. The derivation is based on the concept of hierarchical consistency in the asymptotic regime. We show that this sequence transformation is a special case of the J transformation. Thus, many properties of the I transformation can be deduced from the known...

متن کامل

Nonlinear Sequence Transformations: Computational Tools for the Acceleration of Convergence and the Summation of Divergent Series

Convergence problems occur abundantly in all branches of mathematics or in the mathematical treatment of the sciences. Sequence transformations are principal tools to overcome convergence problems of the kind. They accomplish this by converting a slowly converging or diverging input sequence {sn} ∞ n=0 into another sequence {s ′ n }∞ n=0 with hopefully better numerical properties. Padé approxim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997